Continuous feedback fluid queues
نویسندگان
چکیده
We investigate a fluid buffer which is modulated by a stochastic background process, while the momentary behavior of the background process depends on the current buffer level in a continuous way. Loosely speaking the feedback is such that the background process behaves ‘as a Markov process’ with generator at times when the buffer level is , where the entries of are continuous functions of . Moreover, the flow rates for the buffer may also depend continuously on the current buffer level. Such models are interesting in the context of closed-loop telecommunication networks, in which sources interact with network buffers, but may also be deployed in the study of certain production systems. After defining the feedback behavior precisely, we deduce the Kolmogorov forward equations for the joint background/buffer-process of interest under some regularity assumptions. Interestingly, these equations can also be viewed as the continuity equations for probability mass, and may also be found in this way. For the system with two states for the background process we find an explicit solution for the stationary distribution of the process, which we illustrate by a number of examples. We finally present a numerical method that enables us to find this distribution for the multiple-state cases.
منابع مشابه
UvA - DARE ( Digital Academic Repository ) Continuous feedback fluid queues
We investigate a fluid buffer which is modulated by a stochastic background process, while the momentary behavior of the background process depends on the current buffer level in a continuous way. Loosely speaking the feedback is such that the background process behaves `as a continuous-time Markov chain' with generator Q(y) at times when the buffer level is y, where the entries of Q(y) are con...
متن کاملAnalysis of tandem fluid queues
We consider a model consisting of two fluid queues driven by the same background continuous-time Markov chain, such that the rates of change of the fluid in the second queue depend on whether the first queue is empty or not. We analyse this tandem model using operator-analytic methods.
متن کاملMarkov-modulated and feedback fluid queues
Contents Voorwoord v Contents vii 1 Introduction 1 1.
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 33 شماره
صفحات -
تاریخ انتشار 2005